Cost-optimal constrained correlation clustering via weighted partial Maximum Satisfiability
نویسندگان
چکیده
منابع مشابه
Cost-optimal constrained correlation clustering via weighted partial Maximum Satisfiability
Integration of the fields of constraint solving and data mining and machine learning has recently beenidentified within the AI community as an important research direction with high potential. This work con-tributes to this direction by providing a first study on the applicability of state-of-the-art Boolean optimiza-tion procedures to cost-optimal correlation clustering under c...
متن کاملSurvey propagation applied to weighted partial maximum satisfiability
We adapt the survey propagation method for application to weighted partial maximum satisfiability (WPMax-SAT) problems consisting of a mixture of hard and soft clauses. The aim is to find the truth assignment that minimises the total cost of unsatisfied soft clauses while satisfying all hard clauses. We use fixed points of the new set of message passing equations in a decimation procedure to re...
متن کاملLearning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability
Bayesian network structure learning is the well-known computationally hard problem of finding a directed acyclic graph structure that optimally describes given data. A learned structure can then be used for probabilistic inference. While exact inference in Bayesian networks is in general NP-hard, it is tractable in networks with low treewidth. This provides good motivations for developing algor...
متن کاملConstrained locally weighted clustering
Data clustering is a difficult problem due to the complex and heterogeneous natures of multidimensional data. To improve clustering accuracy, we propose a scheme to capture the local correlation structures: associate each cluster with an independent weighting vector and embed it in the subspace spanned by an adaptive combination of the dimensions. Our clustering algorithm takes advantage of the...
متن کاملSolving (Weighted) Partial MaxSAT through Satisfiability Testing
Recently, Fu and Malik described an unweighted Partial MaxSAT solver based on successive calls to a SAT solver. At the kth iteration the SAT solver tries to certify that there exist an assignment that satisfies all but k clauses. Later Marques-Silva and Planes implemented and extended these ideas. In this paper we present and implement two Partial MaxSAT solvers and the weighted variant of one ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2017
ISSN: 0004-3702
DOI: 10.1016/j.artint.2015.07.001